Parallelizing MiniSat

The Boolean satisfiability (SAT) problem asks whether the variables in a given Boolean formula can be assigned in such a way that the formula evaluates to true. Given a Boolean formula, a SAT solver tries to find a set of satisfying assignments or declares that the formula is unsatisfiable. In this project, we implemented a parallel SAT solver using the Cilk multithreaded programming language. Our parallel implementation is based on MiniSat, a well regarded serial SAT solver known for its efficient implementation and small code base. This report outlines our parallelizing strategy and documents the implementation details of the search function. At the end of the document, we also presents some preliminary experimental results. The parallelized MiniSat has performance comparable to the original implementation when running on single processor. When running with multiple processors, however, the throughput of the solver does not quite scale as the number of processors increases.